Search results for "Algebraic combinatorics"

showing 3 items of 3 documents

Transitive factorizations in the hyperoctahedral group

2008

The classical Hurwitz enumeration problem has a presentation in terms of transitive factor- izationsin the symmetric group. This presentationsuggestsageneralizationfromtypeAto otherfinite reflection groups and, in particular, to type B.W e study this generalization both from ac ombinatorial and a geometric point of view, with the prospect of providing am eans of understanding more of the structure of the moduli spaces of maps with an S2-symmetry. The type A case has been well studied and connects Hurwitz numbers to the moduli space of curves. W ec onjecture an analogous setting for the type B case that is studied here. 1I ntroduction Transitive factorizations of permutations into transposit…

CombinatoricsAlgebraic combinatoricsHurwitz quaternionHurwitz problemSymmetric groupGeneral MathematicsHurwitz's automorphisms theoremHurwitz matrixHurwitz polynomialSettore MAT/03 - GeometriaHyperoctahedral groupMathematicssymmetric group covering space
researchProduct

Periodicity and repetitions in parameterized strings

2008

AbstractOne of the most beautiful and useful notions in the Mathematical Theory of Strings is that of a Period, i.e., an initial piece of a given string that can generate that string by repeating itself at regular intervals. Periods have an elegant mathematical structure and a wealth of applications [F. Mignosi and A. Restivo, Periodicity, Algebraic Combinatorics on Words, in: M. Lothaire (Ed.), Cambridge University Press, Cambridge, pp. 237–274, 2002]. At the hearth of their theory, there are two Periodicity Lemmas: one due to Lyndon and Schutzenberger [The equation aM=bNcP in a free group, Michigan Math. J. 9 (1962) 289–298], referred to as the Weak Version, and the other due to Fine and …

Discrete mathematicsLemma (mathematics)Algebraic combinatoricsCombinatorics on wordsSettore INF/01 - InformaticaApplied MathematicsParameterized complexityParameterized stringsString searching algorithmString (physics)Periodic functionCombinatoricsCombinatorics on wordsDiscrete Mathematics and CombinatoricsString periodicityUniquenessCombinatorics on Words AlgorithmsMathematics
researchProduct

Mahonian STAT on words

2016

In 2000, Babson and Steingrimsson introduced the notion of what is now known as a permutation vincular pattern, and based on it they re-defined known Mahonian statistics and introduced new ones, proving or conjecturing their Mahonity. These conjectures were proved by Foata and Zeilberger in 2001, and by Foata and Randrianarivony in 2006.In 2010, Burstein refined some of these results by giving a bijection between permutations with a fixed value for the major index and those with the same value for STAT , where STAT is one of the statistics defined and proved to be Mahonian in the 2000 Babson and Steingrimsson's paper. Several other statistics are preserved as well by Burstein's bijection.At…

FOS: Computer and information sciencesQA75[ INFO ] Computer Science [cs]Discrete Mathematics (cs.DM)Major index0102 computer and information sciencesMathematical Analysis01 natural sciencesWords and PermutationsCombinatorial problemsEquidistributionTheoretical Computer ScienceCombinatoricssymbols.namesakePermutationBijectionsFOS: MathematicsMathematics - CombinatoricsMathematical proofs[INFO]Computer Science [cs]0101 mathematicsStatisticMathematicsStatisticZ665Algebraic combinatoricsMathematics::CombinatoricsFormal power seriesPatternPermutationsEulerian path16. Peace & justiceComputer Science Applications010101 applied mathematics010201 computation theory & mathematicsCombinatoricsSignal ProcessingsymbolsBijectionCombinatorics (math.CO)Information SystemsComputer Science - Discrete Mathematics
researchProduct